|
Model Elimination is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the Journal of the ACM. Their primary purpose is to carry out automated theorem proving, though they can readily be extended to logic programming, including the more general disjunctive logic programming. Model Elimination is closely related to resolution while also bearing characteristics of a Tableaux method. It is a progenitor of the SLD resolution procedure used in the Prolog logic programming language. While somewhat eclipsed by attention to and progress in Resolution theorem provers, Model Elimination has continued to attract the attention of researchers and software developers. Today there are several theorem provers under active development that are based on the Model Elimination procedure. == References == * Loveland, D. W. (1968) Mechanical theorem-proving by model elimination. Journal of the ACM, 15, 236—251. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Model elimination」の詳細全文を読む スポンサード リンク
|